Extending Digraphs to Digraphs with (without) k-Kernel
نویسنده
چکیده
For any digraph D we construct a digraph s(S) such that D has a k-kernel iff s(S) has a k-kernel. The method employed allows to prove that, any digraph is an induced subdigraph of an infinite set of digraphs with (resp. without) k-kernel; and it can be used as a powerful tool in the construction of a large class of digraphs with (resp. without) k-kernel. Previous results are generalyzed. Mathematics Subject Classification: 05C20
منابع مشابه
More skew-equienergetic digraphs
Two digraphs of same order are said to be skew-equienergetic if their skew energies are equal. One of the open problems proposed by Li and Lian was to construct non-cospectral skew-equienergetic digraphs on n vertices. Recently this problem was solved by Ramane et al. In this paper, we give some new methods to construct new skew-equienergetic digraphs.
متن کاملOn the existence of (k, l)-kernels in infinite digraphs: A survey
Let D be a digraph, V (D) and A(D) will denote the sets of vertices and arcs of D, respectively. A (k, l)-kernel N of D is a k-independent (if u, v ∈ N , u 6= v, then d(u, v), d(v, u) ≥ k) and l-absorbent (if u ∈ V (D) − N then there exists v ∈ N such that d(u, v) ≤ l) set of vertices. A k-kernel is a (k, k− 1)-kernel. This work is a survey of results proving sufficient conditions for the exist...
متن کاملK-colored Kernels
We study k-colored kernels in m-colored digraphs. An m-colored digraph D has k-colored kernel if there exists a subset K of its vertices such that (i) from every vertex v / ∈ K there exists an at most k-colored directed path from v to a vertex of K and (ii) for every u, v ∈ K there does not exist an at most k-colored directed path between them. In this paper, we prove that for every integer k ≥...
متن کاملOn (k, l)-kernels of special superdigraphs of Pm and Cm
The concept of (k, l)-kernels of digraphs was introduced in [2]. Next, H. Galeana-Sanchez [?] proved a sufficient condition for a digraph to have a (k, l)-kernel. The result generalizes the well-known theorem of P. Duchet and it is formulated in terms of symmetric pairs of arcs. Our aim is to give necessary and sufficient conditions for digraphs without symmetric pairs of arcs to have a (k, l)-...
متن کاملK-kernels in K-transitive and K-quasi-transitive Digraphs
Let D be a digraph, V (D) and A(D) will denote the sets of vertices and arcs of D, respectively. A (k, l)-kernel N of D is a k-independent (if u, v ∈ N then d(u, v), d(v, u) ≥ k) and l-absorbent (if u ∈ V (D) − N then there exists v ∈ N such that d(u, v) ≤ l) set of vertices. A k-kernel is a (k, k − 1)-kernel. A digraph D is transitive if (u, v), (v, w) ∈ A(D) implies that (u,w) ∈ A(D). This co...
متن کامل